tree scheme中文什么意思

例句与用法

1. 3 a new group key management scheme based on a full and balanced tree scheme in conjunction with one-way hash chain is proposed . by comparison, we find that it has good performance of low re-key communication costs and scalable property
   提出一种采用单向哈希链结合完全平衡树的分层密钥管理方法，比较表明它在密钥更新时通信次数较少，是一种高效的密钥管理方案。
2. these sheme implement the joining of new group members, leaving and moving amount the domain of group member; we adopt the batch rekeying method in individual mss domain to reduce the waste of overlapping rekeying for key path; we divide the cost of t-tree scheme into wireless cost and wired cost, and discuss them operately
   该方案实现了组成员的加入,组成员的离开以及成员的域间移动;对单个mss域内采用批量更新的办法,减少了重复更新密钥路径造成的浪费;将t树方案的开销分为有线开销和无线开销,分别进行讨论。
3. at last, we compare the three sheme including skdc, lkh and m-tree sheme from four aspect : memory cost, encryption cost, decryption cost and transportation cost . we find that : the encryption cost and transportation cost of lkh and m-tree sheme when one group member leaves the group is o ( logn ), but the cost of m-tree scheme is more than lkh scheme; the cost of skdc scheme is o ( n ), so the skdc scheme is not a scalable scheme; the encryption cost and decryption cost when user join and memory cost of m-tree scheme is small than lkh scheme
   最后,从存储开销,加密开销,解密开销和通信开销四个方面对skdc,lkh和m树方案进行了比较,发现lkh和m树方案在组成员离开时的加密和传输开销为o(logn),但是m树方案的开销略大于lkh方案;而skdc方案的开销为o(n),因此skdc方案的扩展性很差;在存储开销以及成员加入时的加密和解密开销方面,m树方案的性能优于lkh方案。
4. at last, we compare the three sheme including skdc, lkh and m-tree sheme from four aspect : memory cost, encryption cost, decryption cost and transportation cost . we find that : the encryption cost and transportation cost of lkh and m-tree sheme when one group member leaves the group is o ( logn ), but the cost of m-tree scheme is more than lkh scheme; the cost of skdc scheme is o ( n ), so the skdc scheme is not a scalable scheme; the encryption cost and decryption cost when user join and memory cost of m-tree scheme is small than lkh scheme
   最后,从存储开销,加密开销,解密开销和通信开销四个方面对skdc,lkh和m树方案进行了比较,发现lkh和m树方案在组成员离开时的加密和传输开销为o(logn),但是m树方案的开销略大于lkh方案;而skdc方案的开销为o(n),因此skdc方案的扩展性很差;在存储开销以及成员加入时的加密和解密开销方面,m树方案的性能优于lkh方案。
5. we design two different method to build the m-tree called static method and dynamic method separately, and we improve the dynamic initialization process of m-tree scheme by utilizing the dh algorithm . this improvement reduces the encryption cost efficiently in the initialization process . by taking stock of disparity cost between the m-tree and lkh sheme, we found that the encryption cost in joining and leaving operation achieve balance when r = 19
   设计了动态和静态两种m树的建立方法,并利用哈希函数改进了动态的初始化过程,减少了初始化过程的加密开销;总结归纳出skdc,lkh和m树三种方案的性能分析表;通过观察m树和lkh方案开销差随r的变化,发现当r=19时,加入和离开操作的加密开销达到平衡。